Redefining the term ‘Reconfigurable-Chips’: Unsolving the Rubik’s Cube
نویسندگان
چکیده
Taking inspiration from the brain, where dynamic reconfiguration of neuron inter-connectivity occurs continually during learning [1], the field of re-configurable computing emerged a few decades back. These systems have the ability to adapt and make substantial changes to the data path and control flow on the re-configurable fabric. But, these systems, in the true sense, do not physically displace the components on the chip to evolve into a more intelligent system. In this abstract, we break free from conventional thinking and propose a thought-provoking idea with a realistic model to design a true re-configurable chip. This chip is designed to adapt to a wide dimension of an application mix‟s needs. Moreover, we strike a communication-centric approach, rather than a traditional computation-centric one.
منابع مشابه
The Group Structure of the Rubik’s Cube
The Rubik’s Cube is a familiar toy that has embedded itself into popular culture since its invention in 1974 by Ernő Rubik. It is especially popular among mathematicians, for good reason. In this paper, we will investigate some of the interesting mathematical structure underlying the Rubik’s Cube, which was documented by David Joyner in his book, Adventures in Group Theory [Joy]. Let us conside...
متن کاملGroup Theory and the Rubik’s Cube
The Rubik’s Cube is a well known puzzle that has remarkable group theory properties. The objective of this project is to understand how the Rubik’s Cube operates as a group and explicitly construct the Rubik’s Cube Group.
متن کاملAlgorithms for Solving Rubik's Cubes
The Rubik’s Cube is perhaps the world’s most famous and iconic puzzle, well-known to have a rich underlying mathematical structure (group theory). In this paper, we show that the Rubik’s Cube also has a rich underlying algorithmic structure. Specifically, we show that the n×n×n Rubik’s Cube, as well as the n×n×1 variant, has a “God’s Number” (diameter of the configuration space) of Θ(n/ logn). ...
متن کاملSub-Optimal Multi-Phase Path Planning: A Method for Solving Rubik's Revenge
Rubik’s Revenge, a 4× 4× 4 variant of the Rubik’s puzzles, remains to date as an unsolved puzzle. That is to say, we do not have a method or successful categorization to optimally solve every one of its approximately 7.401×10 possible configurations. Rubik’s Cube, Rubik’s Revenge’s predecessor (3×3×3), with its approximately 4.33 × 10 possible configurations, has only recently been completely s...
متن کاملRubik’s Cube Puzzle as a Benchmark for Service Robots
This paper describes Rubik’s cube manipulation as an example of highly demanding benchmark task for two-handed service robot. Vision is used both for acquiring the cube (servoing) and identifying its initial configuration. During two-handed manipulation force/torque measurements are used to prevent jamming of the cube. Rubik’s cube solver, nominal trajectory generation, visual servoing, and pos...
متن کامل